The INPUT and Faithfulness in OT Syntax

نویسنده

  • Peter Sells
چکیده

I consider some of the claims that have been made for and against the nature of the INPUT in OT syntax as developed within the assumptions of the Minimalist Program, leading to suggestions for further specification of the architecture of this approach. Comparing with the role of faithfulness in the OT approach developed from Lexical-Functional Grammar, I argue that specific linguistic analyses crucially involve reference to faithfulness constraints (MAX and DEP in correspondence-based OT) which apply across different parts of the output structures, but do not need to refer to the INPUT. I conclude that while OT syntax does not need INPUTs per se, it does need faithfulness constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Expressivity of Optimality Theory versus Ordered Rewrite Rules

I prove that there are phonological patterns which are expressible by ordered rewrite rules but not by any Optimality Theoretic (OT) grammar whose constraint set contains only markedness constraints and single–state faithfulness constraints, i.e. faithfulness constraints that assign violation marks to pairs of single input–output segments in correspondence, with no reference to other segments i...

متن کامل

Default Case in OT Syntax

Default case appears when a DP cannot get case through normal syntactic mechanisms (Schütze 2001). In an OT system, default case is best analyzed as an example of emergence of the unmarked. When case cannot be assigned, the least marked case is used. A constraint system is developed that includes markedness constraints for assigning structural case and faithfulness constraints for assigning non...

متن کامل

Formal and computational aspects of optimality-theoretic syntax

In this dissertation, I propose a formal framework for stating in detail a class of Optimality-Theoretic models for syntax. I discuss empirical consequences of the key choices in the formalization and investigate computational properties of the models, in particular decidability of the parsing and generation tasks. The candidate analyses I assume are non-derivational, represented as tuples of p...

متن کامل

Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures

This paper describes an algorithm for computing optimal structural descriptions for Optimality Theory grammars with context-free position structures. This algorithm extends Tesar's dynamic programming approach (Tesar, 1994) (Tesar, 1995a) to computing optimal structural descriptions from regular to context-free structures. The generalization to contextfree structures creates several complicatio...

متن کامل

Model theory and the content of OT constraints

We develop an extensible description logic for stating the content of optimalitytheoretic constraints in phonology, and specify a class of structures for interpreting it. The aim is a transparent formalisation of OT. We show how to state a wide range of constraints, including markedness, input–output faithfulness and base–reduplicant faithfulness. However, output–output correspondence and ‘inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003